Kron’s method of subspaces

A new method for constructing invariant subspaces

The new idea that is used in this article for producing non-trivial (closed) invariant subspaces of (bounded linear) operators on reflexive Banach spaces, is the use of fixed points of set-valued functions. The advantage of this new method is that it is reasonable to expect that the famous method of Lomonosov for producing invariant subspaces using fixed points of functions, can be viewed as a ...

Support Subspaces Method for Fractal Images Recognition

This paper presents the recognition method of fractal images. The approach is considered based on using support subspaces. Support subspaces are constructed with vectors of source data using a conjunction index. The proposed new computing algorithm for the conjugation index reduces requirements for computing capacities and memory. It is shown that the proposed method of construction, supporting...

Comment on frame's of subspaces

Covering of subspaces by subspaces

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph Gq(n, r) by subspaces from the Grassmann graph Gq(n, k), k ≥ r , are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, q-analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and...

Matrix Method for Lcmm — Connection between Subspaces of Reference Points

The article describes the transplantation of Matrix Method as an assessment of accuracy of coordinate measurement for Large CMM. The method of the synthetic description of the accuracy is used successfully for small and medium-sized CMMs. It is implemented for large measurements as research project nr: PB 5T07/D03824. The issue involves many problems, especially from a technical point of view. ...